FairTorrent: A Deficit-Based Distributed Algorithm to Ensure Fairness in Peer-to-Peer Systems

TAC: A Topology-Aware Chord-based Peer-to-Peer Network

Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...

Distributed multiple selection algorithm for peer-to-peer systems

This paper presents an efficient distributed multiple selection algorithm designed to select multiple keys simultaneously from different data sets which are distributed to many computers in a peer-to-peer system. The communication time is usually much longer than the computation time and is thus a major criterion for measuring the performance of a distributed algorithm. The objective of this al...

Fairness in Peer-to-Peer Networks

Consider a P2P network consisting of a set of peers P and a set of services S, whereby each peer p is interested in one or several services and/or offers different services. Thereby, providing a service consumes a scarce resource. We denote the capacity of this resource at peer p as Cp. To differentiate between service providing and service requesting peers in our model we introduce the set of ...

Stimulating fairness in peer-to-peer networks

A distributed EM algorithm for large peer-to-peer networks

We propose a new distributed algorithm for Gaussian mixture learning: Newscast EM. The algorithm can run on large peer-to-peer networks in which each node observes a local quantity and can communicate with other nodes in a random, anonymous fashion. The main difference with the standard (centralized) EM algorithm is the M-step which is implemented in a decentralized manner: random pairs of node...